Art gallery problem - PDFSEARCH.IO - Document Search Engine

Art gallery problem
Results: 63

#	Item
21	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, Ramesh Krishnamurti †, Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:40 Computational geometry Simple polygon Travelling salesman problem Mathematics Applied mathematics Art gallery problem
22	CCCG 2011, Toronto ON, August 10–12, 2011 Edge-guarding Orthogonal Polyhedra Nadia M. Benbernou∗ Erik D. Demaine† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Space-filling polyhedra Zonohedra Polyhedra Polyhedron Art gallery problem Icosahedron Octahedron Vertex Cuboid Geometry Platonic solids Deltahedra
23	CCCG 2011, Toronto ON, August 10–12, 2011 Computing k-Link Visibility Polygons in Environments with a Reflective Edge Salma S. Mahdavi ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Visibility polygon Art gallery problem Polygon Shading Vertex Area Computational geometry Star-shaped polygon Polygon triangulation Geometry Polygons Simple polygon
24	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 VC-Dimension of Visibility on Terrains James King∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:09:07 Polygons Mathematics Art gallery problem VC dimension Simple polygon Area Applied mathematics Computational geometry Computational learning theory Geometry
25	CCCG 2011, Toronto ON, August 10–12, 2011 Computing k-Link Visibility Polygons in Environments with a Reflective Edge Salma S. Mahdavi ∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Visibility polygon Art gallery problem Polygon Shading Vertex Area Computational geometry Star-shaped polygon Polygon triangulation Geometry Polygons Simple polygon
26	CCCG 2011, Toronto ON, August 10–12, 2011 Finding Optimal Geodesic Bridges Between Two Simple Polygons Amit M. Bhosle∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Computational geometry Discrete geometry Euclidean plane geometry Simple polygon Geodesic Vertex Distance Voronoi diagram Art gallery problem Geometry Mathematics Polygons
27	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Triangulating and Guarding Realistic Polygons G. Aloupis ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:26 Art gallery problem Polygon triangulation Monotone polygon Star-shaped polygon Polygon Visibility polygon Binary space partitioning Vertex Computational geometry Geometry Polygons Simple polygon
28	cccg-cluster_visibility-2.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 NP-complete problems Art gallery problem Steiner tree problem Vertex Connectivity Pseudotriangle Tree Graph Dominating set Graph theory Mathematics Theoretical computer science
29	triangulating-guarded-polygons-journal.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:28 Star-shaped polygon Monotone polygon Area Binary space partitioning Visibility polygon Art gallery problem Star polygon Geometry Polygons Simple polygon
30	CCCG 2011, Toronto ON, August 10–12, 2011 Finding Optimal Geodesic Bridges Between Two Simple Polygons Amit M. Bhosle∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Computational geometry Discrete geometry Euclidean plane geometry Simple polygon Geodesic Vertex Distance Voronoi diagram Art gallery problem Geometry Mathematics Polygons

UPDATE